On Mersenne polynomials over F2
نویسندگان
چکیده
منابع مشابه
Odd perfect polynomials over F2
A perfect polynomial over F2 is a polynomial A ∈ F2[x] that equals the sum of all its divisors. If gcd(A, x + x) = 1 then we say that A is odd. In this paper we show the non-existence of odd perfect polynomials with either three prime divisors or with at most nine prime divisors provided that all exponents are equal to 2.
متن کاملQuantum circuits and low-degree polynomials over F2
In this work we explore a correspondence between quantum circuits and low-degree polynomials over the finite field F2. Any quantum circuit made up of Hadamard, Z, controlled-Z and controlled-controlled-Z gates gives rise to a degree-3 polynomial over F2 such that calculating quantum circuit amplitudes is equivalent to counting zeroes of the corresponding polynomial. We exploit this connection, ...
متن کاملFactoring high-degree polynomials over F2 with Niederreiter's algorithm on the IBM SP2
A C implementation of Niederreiter’s algorithm for factoring polynomials over F2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain system of linear equations, is performed in parallel. Once a basis for the solution space is found, all irreducible factors of the polynomial can be extracted by suitable gcdcomputations. For this purpos...
متن کاملOn the F2-linear relations of Mersenne Twister pseudorandom number generators
Sequence generators obtained by linear recursions over the two-element field F2, i.e., F2-linear generators, are widely used as pseudorandom number generators. For example, the Mersenne Twister MT19937 is one of the most successful applications. An advantage of such generators is that we can assess them quickly by using theoretical criteria, such as the dimension of equidistribution with v-bit ...
متن کاملPolynomial factorization over F2
We describe algorithms for polynomial factorization over the binary field F2, and their implementation. They allow polynomials of degree up to 250 000 to be factored in about one day of CPU time, distributing the work on two processors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2019
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2019.06.006